#include <stdio.h>
#include <algorithm>

#define MAX 20000

static int d[MAX];  /* diameter of dragon heads */
static int n;       /* number of dragon heads */
static int h[MAX];  /* height of knights */
static int m;       /* number of knights */

static int solve()
{
    std::sort(d + 0, d + n);
    std::sort(h + 0, h + m);
    int i = 0, j = 0, cost = 0;
    while (i < n && j < m)
    {
        if (h[j] >= d[i])
        {
            cost += h[j];
            i++;
        }
        j++;
    }
    return (i < n)? -1 : cost;
}

int main()
{
    while (scanf("%d %d", &n, &m) == 2 && n > 0)
    {
        for (int i = 0; i < n; i++)
            scanf("%d", &d[i]);
        for (int j = 0; j < m; j++)
            scanf("%d", &h[j]);
        int cost = solve();
        if (cost >= 0)
            printf("%d\n", cost);
        else
            printf("Loowater is doomed!\n");
    }
    return 0;
}